Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs
نویسنده
چکیده
We use the known linear lower bound for Tseitin's tautologies for establishing linear lower bounds on the degree of Nullstellensatz proofs (in the usual boolean setting) for explicitly constructed systems of polyno-mials of a constant (in our construction 6) degree. It holds over any eld of characteristic distinct from 2. Previously, a linear lower bound was proved 14] for an explicitly constructed system of polynomials of a logarithmic degree.
منابع مشابه
Lower bounds on Nullstellensatz proofs via designs
The Nullstellensatz proof system is a proof system for propositional logic based on algebraic identities in fields. Prior work has proved lower bounds of the degree Nullstellensatz refutations using combinatorial constructions called designs. This paper surveys the use of designs for Nullstellensatz lower bounds. We give a new, more general definition of designs. We present an explicit construc...
متن کاملLower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies
We prove an exponential lower bound on the size of static LovászSchrijver proofs of Tseitin tautologies. We use several techniques, namely, translating static LS+ proof into Positivstellensatz proof of Grigoriev et al., extracting a “good” expander out of a given graph by removing edges and vertices of Alekhnovich et al., and proving linear lower bound on the degree of Positivstellensatz proofs...
متن کاملOn extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of functions associated with the tautologies. Such bounds can potentially be used to prove (conditional or unconditional) lower bounds on the lengths of proofs of these tautologies and show separations of some weak proof syst...
متن کاملProof complexity of intuitionistic implicational formulas
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF ) or substitution Frege (SF ) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC p...
متن کاملProofs and Games
Proof complexity is a vivid field in the intersection of logic and complexity that investigates proofs towards the main aim of understanding the complexity of theorem proving procedures. Most research in proof complexity concerns proving lower bounds to the lengths of proofs. The aim of this course is to present an up-to-date introduction to propositional proof complexity with emphasis on game-...
متن کامل